Conforming restricted Delaunay mesh generation for piecewise smooth complexes
نویسنده
چکیده
A Frontal-Delaunay refinement algorithm for mesh generation in piecewise smooth domains is described. Built using a restricted Delaunay framework, this new algorithm combines a number of novel features, including: (i) an unweighted, conforming restricted Delaunay representation for domains specified as a (non-manifold) collection of piecewise smooth surface patches and curve segments, (ii) a protection strategy for domains containing curve segments that subtend sharply acute angles, and (iii) a new class of offcentre refinement rules designed to achieve high-quality point-placement along embedded curve features. Experimental comparisons show that the new Frontal-Delaunay algorithm outperforms a classical (statically weighted) restricted Delaunay-refinement technique for a number of three-dimensional benchmark problems.
منابع مشابه
Reconstructing Piecewise Curved Complexes∗
We present an algorithm and its implementation to reconstruct a complex composed of surfaces from an unorganized point cloud. The output is a triangular mesh that approximates the unknown complex. A wide variety of non-smooth features are handled, including boundaries, vertices and junction curves with manifold or non-manifold neighborhood where multiple surfaces meet, and creases where surface...
متن کاملMeshing 3D Domains Bounded by Piecewise Smooth Surfaces*
This paper proposes an algorithm to mesh 3D domains bounded by piecewise smooth surfaces. The algorithm handle multivolume domains defined by surfaces that may be non connected or non manifold. The boundary and subdivision surfaces are assumed to be described by a complex formed by surface patches stitched together along curve segments. The meshing algorithm is a Delaunay refinement and it uses...
متن کامل5A.3 A Practical Delaunay Meshing Algorithm for a Large Class of Domains∗
Recently a Delaunay refinement algorithm has been proposed that can mesh domains as general as piecewise smooth complexes [7]. This class includes polyhedra, smooth and piecewise smooth surfaces, volumes enclosed by them, and above all non-manifolds. In contrast to previous approaches, the algorithm does not impose any restriction on the input angles. Although this algorithm has a provable guar...
متن کاملA Practical Delaunay Meshing Algorithm for aLarge Class of Domains*
Recently a Delaunay refinement algorithm has been proposed that can mesh domains as general as piecewise smooth complexes [7]. This class includes polyhedra, smooth and piecewise smooth surfaces, volumes enclosed by them, and above all non-manifolds. In contrast to previous approaches, the algorithm does not impose any restriction on the input angles. Although this algorithm has a provable guar...
متن کاملDelaunay Meshing of Piecewise Smooth Complexes without Expensive Predicates
Recently a Delaunay refinement algorithm has been proposed that can mesh piecewise smooth complexes which include polyhedra, smooth and piecewise smooth surfaces, and nonmanifolds. However, this algorithm employs domain dependent numerical predicates, some of which could be computationally expensive and hard to implement. In this paper we develop a refinement strategy that eliminates these comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1606.01289 شماره
صفحات -
تاریخ انتشار 2016